Edge pair sum labeling of spider graph
نویسندگان
چکیده مقاله:
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} according as p is even or odd. A graph which admits edge pair sum labeling is called an edge pair sum graph. In this paper we exhibit some spider graph.
منابع مشابه
edge pair sum labeling of spider graph
an injective map f : e(g) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph g(p, q) if the induced vertex function f*: v (g) → z − {0} defined by f*(v) = (sigma e∈ev) f (e) is one-one, where ev denotes the set of edges in g that are incident with a vetex v and f*(v (g)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} u {k(p+1)/2} accordin...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملedge pair sum labeling of some cycle related graphs
let g be a (p,q) graph. an injective map f : e(g) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: v (g) → z - {0} defi ned by f*(v) = σp∈ev f (e) is one-one where ev denotes the set of edges in g that are incident with a vertex v and f*(v (g)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} u {±k(p+1)/2} according a...
متن کاملSuper Pair Sum Labeling of Graphs
Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)cup E(G)$ to ${0, pm 1, pm2, dots, pm (frac{p+q-1}{2})}$ when $p+q$ is odd and from $V(G)cup E(G)$ to ${pm 1, pm 2, dots, pm (frac{p+q}{2})}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {...
متن کاملEdge Pair Sum Labeling of Some Subdivision of Graphs
An injective map f : E(G) → {±1,±2, · · · ,±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f∗ : V (G) → Z − {0} defined by f∗(v) = ∑ e∈Ev f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f∗(V (G)) is either of the form { ±k1,±k2, · · · ,±k p 2 } or { ±k1,±k2, · · · ,±k p−1 2 } ∪ { ±k p+1 2 } according as ...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 45 شماره 1
صفحات 25- 34
تاریخ انتشار 2014-11-20
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023